Spatially Coupled PLDPC-Hadamard Convolutional Codes

We propose a new type of ultimate-Shannon-limit-approaching codes called spatially coupled protograph-based low-density parity-check Hadamard convolutional (SC-PLDPCH-CCs), which are constructed by coupling PLDPC-Hadamard block codes. develop an efficient decoding algorithm that combines pipeline and layered scheduling for the SC-PLDPCH-CCs, analyze latency complexity decoder. To estimate thresholds we first protograph extrinsic information transfer (PEXIT) to evaluate terminated (SC-PLDPCH-TDCs) with moderate length. With use proposed PEXIT method, genetic find good SC-PLDPCH-TDCs in systematic way. Then extend length these form SC-PLDPCH-CCs. Results show our SC-PLDPCH-CCs can achieve comparable code counterparts. Simulations illustrate superiority over counterparts other state-of-the-art low-rate terms error performance. For rate-0.00295 SC-PLDPCH-CC, bit rate 10 ?5 is achieved at $E_{b}/N_{0} = -1.465$ dB, only 0.125 dB from ultimate Shannon limit.